Linear-time algorithm for sliding tokens on trees
نویسندگان
چکیده
منابع مشابه
Linear-time algorithm for sliding tokens on trees
16 Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib| = |Ir|, and imagine that a token is placed on each vertex in Ib. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms Ib into Ir so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge ...
متن کاملPolynomial-Time Algorithm for Sliding Tokens on Trees
Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib| = |Ir|, and imagine that a token is placed on each vertex in Ib. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms Ib into Ir so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in ...
متن کاملSliding Tokens on a Cactus
Given two independent sets I and J of a graph G, imagine that a token (coin) is placed on each vertex in I. Then, the Sliding Token problem asks if one could transforms I to J using a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors, such that the resulting set of vertices where tokens are placed still remains independent. In this pa...
متن کاملLinear Time Maximum Induced Matching Algorithm for Trees
A matching in a graph G is a collection of non-intersecting edges. The matching is induced if no two edges in the matching are joined by an edge in G. This paper studies the complexity of nding a largest induced matching when the input graph is a tree. We describe the rst linear time algorithm for this problem.
متن کاملA Linear-Time Algorithm for Integral Multiterminal Flows in Trees
In this paper, we study the problem of finding an integral multiflow which maximizes the sum of flow values between every two terminals in an undirected tree with a nonnegative integer edge capacity and a set of terminals. In general, it is known that the flow value of an integral multiflow is bounded by the cut value of a cut-system which consists of disjoint subsets each of which contains exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.07.037